the neighbourhood polynomial of some nanostructures

Authors

s. alikhani

e. mahmoudi

abstract

the neighbourhood polynomial g , is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph. in other word $n(g,x)=sum_{uin n(g)} x^{|u|}$, where n(g) is neighbourhood complex of a graph, whose vertices are the vertices of the graph and faces are subsets of vertices that have a common neighbour. in this paper we compute this polynomial for some nanostructures.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

The Neighbourhood Polynomial of some Nanostructures

The neighbourhood polynomial G , is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph. In other word $N(G,x)=sum_{Uin N(G)} x^{|U|}$, where N(G) is neighbourhood complex of a graph, whose vertices are the vertices of the graph and faces are subsets of vertices that have a common neighbour. In this paper we compute this polynomial for some na...

full text

extensions of some polynomial inequalities to the polar derivative

توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی

15 صفحه اول

The neighbourhood polynomial of a graph

We examine neighbourhood polynomials, which are generating functions for the number of faces of each cardinality in the neighbourhood complex of a graph. We provide explicit polynomials for hypercubes, for graphs not containing a four-cycle and for the graphs resulting from joins and Cartesian products. We also show that the closure of the roots are dense in the complex plane except possibly in...

full text

Flow Polynomial of some Dendrimers

Suppose G is an nvertex and medge simple graph with edge set E(G). An integervalued function f: E(G) → Z is called a flow. Tutte was introduced the flow polynomial F(G, λ) as a polynomial in an indeterminate λ with integer coefficients by F(G,λ) In this paper the Flow polynomial of some dendrimers are computed.

full text

Some New Results On the Hosoya Polynomial of Graph Operations

The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...

full text

Some results on the polynomial numerical hulls of matrices

In this note we characterize polynomial numerical hulls of matrices $A in M_n$ such that$A^2$ is Hermitian. Also, we consider normal matrices $A in M_n$ whose $k^{th}$ power are semidefinite. For such matriceswe show that $V^k(A)=sigma(A)$.

full text

My Resources

Save resource for easier access later


Journal title:
iranian journal of mathematical chemistry

Publisher: university of kashan

ISSN 2228-6489

volume 5

issue Supplement 1 2014

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023